The firefighter problem with more than one firefighter on trees

In this paper we study the complexity of the firefighter problem and related problems on trees when more than one firefighter is available at each time step, and answer several open questions of [8]. More precisely, when b ≥ 2 firefighters are allowed at each time step, the problem is NP-complete for trees of maximum degree b+2 and polynomial-time solvable for trees of maximum degree b + 2 when the fire breaks out at a vertex of degree at most b + 1. Moreover we present a polynomial-time algorithm for a subclass of trees, namely k-caterpillars.